Exploiting Constraint Dependency Information For Debugging and Explanation
نویسندگان
چکیده
Constraint programming is another form of programming and, as such, should be supported by appropriate environments that support debugging, explanation and optimization. We are building tools needed in such an environment and using them in the context of geometric constraint programming for graphics and mechanical design. In this paper, we present the components of such an environment and their capabilities. We also describe an algorithm for identifying constraints that cause a model to be over-constrained.
منابع مشابه
Explanations and error diagnosis
The report proposes a theoretical approach of the debugging of constraint programs based on the notion of explanation tree (D1.1.1 and D1.1.2 part 2). The proposed approach is an attempt to adapt algorithmic debugging to constraint programming. In this theoretical framework for domain reduction, explanations are proof trees explaining value removals. These proof trees are defined by inductive d...
متن کاملTowards declarative diagnosis of constraint programs over finite domains
The paper proposes a theoretical approach of the debugging of constraint programs based on a notion of explanation tree. The proposed approach is an attempt to adapt algorithmic debugging to constraint programming. In this theoretical framework for domain reduction, explanations are proof trees explaining value removals. These proof trees are defined by inductive definitions which express the r...
متن کاملImproving Success Ratio in Multi-Constraint Quality of Service Routing
Multi-constraint quality-of-service routing will become increasingly important as the Internet evolves to support real-time services. It is well known however, that optimum multi-constraint QoS routing is computationally complex, and for this reason various heuristics have been proposed for routing in practical situations. Among these methods, those that use a single mixed metric are the mo...
متن کاملValue Withdrawal Explanation in CSP
This work is devoted to constraint solving motivated by the debugging of constraint logic programs a la GNU-Prolog. The paper focuses only on the constraints. In this framework, constraint solving amounts to domain reduction. A computation is formalized by a chaotic iteration. The computed result is described as a closure. This model is well suited to the design of debugging notions and tools, ...
متن کاملPlanning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan
This paper reviews the connections between Graphplan’s planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search techniques to the Graphplan algorithm. It then describes how explanation based learning, dependency directed backtracking, dynamic variable ordering, forward checking, sticky values and random-restart search strategies can be adapte...
متن کامل